Optimal Online Preemptive Scheduling
نویسنده
چکیده
In this lecture we’ll study online preemptive scheduling on m machines of arbitrary speeds. We’ll first review the problem and it’s associated literature, then give an optimal deterministic algorithm known as ”RatioStretch”. RatioStretch uses the optimal competitive ratio R > 1 as an input, and achieves R whenever such an R is obtainable. The exact optimal R maybe computed via a linear program, however it varies based on the problem input parameters and in general is unknown (as an absolute constant over all possible machines).
منابع مشابه
Optimal and Online Preemptive Scheduling on Uniformly Related Machines
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard doubling technique, this yields a 4-competitive deterministic and an e≈ 2.71-competitive randomized online algorithm. In addition, it matches the performance of the previously known...
متن کاملApproximation Results for Preemptive Stochastic Online Scheduling
We present first constant performance guarantees for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release dates on identical parallel machines we derive policies with a guaranteed performance ratio of 2 which matches the currently best known result for the corresponding deterministic online problem. Our policies apply to the recentl...
متن کاملApproximation in Preemptive Stochastic Online Scheduling
We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release dates on identical parallel machines we derive a policy with a guaranteed performance ratio of 2 which matches the currently best known result for the corresponding deterministic online problem. Our policy applies to the recent...
متن کاملSeparating online scheduling algorithms with the relative worst order ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline algorithm. The measure has been successfully applied to problems like paging and bin packing. In this paper, we apply it to machine scheduling. We show that for preemptive scheduling, the measure separates multiple p...
متن کاملSemi-online scheduling with decreasing job sizes
We investigate the problem of semi-online scheduling jobs on m identical parallel machines where the jobs arrive in order of decreasing sizes. We present a complete solution for the preemptive variant of semi-online scheduling with decreasing job sizes. We give matching lower and upper bounds on the competitive ratio for any xed number m of machines; these bounds tend to 1 2 (1+ p 3) 1:36603, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016